A Heuristic to Generate All Best Partially Disjoint Paths in a Communications Network
نویسندگان
چکیده
RMIT University Melbourne, BOX 2476V, VIC 3001, Australia, fkist,[email protected] Abstract This paper considers a directed graph G(N;A) with n nodes, m directed arcs and a cost value for each arc. The synthesis of a partially link disjoint pair of paths for a given OD-pair with the minimum total cost is investigated. An algorithm is presented that solves the all-best partially disjoint path problem. The expected worst case running time of the algorithm is O(n3). Possible applications include light path design and MPLS based traffic engineering. Partially disjoint path algorithms can also be used as intelligent alternatives to k-th shortest path algorithms.
منابع مشابه
Note on the Problem of Partially Link Disjoint Paths
This paper discusses the problem of partially link disjoint paths in communication networks. The problem is situated in between the well-known shortest path generation and the synthesis of two disjoint paths. The contributions of this paper are twofold: Firstly, topologies and relevant graph properties are investigated and the degree of divergence is defined as a metric to distinguish the degre...
متن کاملOn Finding Maximum Disjoint Paths for Many-to-One Routing in Wireless Multi-Hop Network
Provisioning multiple paths can improve fault tolerance and transport capability of multi-routing in wireless networks. Disjoint paths can improve the diversity of paths and further reduce the risk of simultaneous link failure and network congestion. In this paper we first address a many-to-one disjoint-path problem (MOND) for multi-path routing in a multi-hop wireless network. The objective of...
متن کاملFinding Minimum Energy Disjoint Paths in Wireless Ad-Hoc Networks
We develop algorithms for finding minimum energy disjoint paths in an all-wireless network, for both the node and link-disjoint cases. Our major results include a novel polynomial time algorithm that optimally solves the minimum energy 2 link-disjoint paths problem, as well as a polynomial time algorithm for the minimum energy k node-disjoint paths problem. In addition, we present efficient heu...
متن کاملReliability and Energy-Efficiency in Wireless Ad-Hoc Networks
In this thesis, we address issues related to reliability and energy-efficiency in wireless ad hoc networks. In the first part of the work, we deal with the problem of simultaneously routing data along multiple disjoint paths from a source to destination in the most energy efficient manner. To this end, we developed and analyzed both optimal and heuristic algorithms that find minimum energy node...
متن کاملFinding Multiple Length-Bounded Disjoint Paths in Wireless Sensor Networks
In a wireless sensor network, routing messages between two nodes s and t with multiple disjoint paths will increase the throughput, robustness and load balance of the network. The existing researches focus on finding multiple disjoint paths connecting s and t efficiently, but they do not consider length constraint of the paths. A too long path will be useless because of high latency and high pa...
متن کامل